package oj;

/**
 * @author 郝文雪
 * @date 2022/8/24 11:46
 * @Description Test
 */
public class LC33 {
    public int search(int[] nums, int target) {
        if(nums.length==0) return 0;
        int l=0;
        int r=nums.length-1;
        while(l<=r){
            int mid=(r-l)/2+l;
            if(nums[mid]==target) return mid;
            if(nums[0]<=nums[mid]){
                if(nums[0]<=target && target<nums[mid]){
                    r=mid-1;
                }else{
                    l=mid+1;
                }
            }else{
                if(nums[mid]<target && target<=nums[nums.length-1]){
                    l=mid+1;
                }else{
                    r=mid-1;
                }
            }
        }
        return -1;
    }
}
